Upward planar graphs and their duals
نویسندگان
چکیده
We consider upward planar drawings of directed graphs in the plane (UP), and on standing (SUP) and rolling cylinders (RUP). In the plane and on the standing cylinder the edge curves are monotonically increasing in y-direction. On the rolling cylinder they wind unidirectionally around the cylinder. There is a strict hierarchy of classes of upward planar graphs: UP ⊂ SUP ⊂ RUP. In this paper, we show that rolling and standing cylinders switch roles when considering an upward planar graph and its dual. In particular, we prove that a strongly connected graph is RUP if and only if its dual is a SUP dipole. A dipole is an acyclic graph with a single source and a single sink. All RUP graphs are characterized in terms of their duals using generalized dipoles. Moreover, we obtain a characterization of the primals and duals of wSUP graphs which are upward planar graphs on the standing cylinder and allow for horizontal edge curves.
منابع مشابه
The Duals of Upward Planar Graphs on Cylinders
We consider directed planar graphs with an upward planar drawing on the rolling and standing cylinders. These classes extend the upward planar graphs in the plane. Here, we address the dual graphs. Our main result is a combinatorial characterization of these sets of upward planar graphs. It basically shows that the roles of the standing and the rolling cylinders are interchanged for their duals.
متن کاملClassification of Planar Upward Embedding
We consider planar upward drawings of directed graphs on arbitrary surfaces where the upward direction is defined by a vector field. This generalizes earlier approaches using surfaces with a fixed embedding in R and introduces new classes of planar upward drawable graphs, where some of them even allow cycles. Our approach leads to a classification of planar upward embeddability. In particular, ...
متن کاملOn the Number of Upward Planar Orientations of Maximal Planar Graphs
We consider the problem of determining the maximum and the minimum number of upward planar orientations a maximal planar graph can have. We show that n-vertex maximal planar graphs have at least Ω(n · 1.189) and at most O(n · 4) upward planar orientations. Moreover, there exist n-vertex maximal planar graphs having as few as O(n · 2) upward planar orientations and n-vertex maximal planar graphs...
متن کاملOn Finding the Rectangular Duals of Planar Triangular Graphs
We present a new linear time algorithm for nding rectangular duals of planar triangular graphs. The algorithm is conceptually simpler than the previous known algorithm. The coordinates of the rectangular dual constructed by our algorithm are integers and have pure combinatorial meaning. This allows us to discuss the heuristics for minimizing the size of the rectangular duals.
متن کاملCombinatorial characterization of upward planarity
We give a purely combinatorial characterization of upward planar graphs in terms of upward planar orders, which also applies to characterize the planarity for nondirected graphs.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Theor. Comput. Sci.
دوره 571 شماره
صفحات -
تاریخ انتشار 2015